Erlang arrival

См. также в других словарях:

• Erlang-B — (sometimes also written without the hyphen Erlang B) is a formula derived from the Erlang distribution to describe the probability of call loss on a group of circuits (in a circuit switched network, or equivalent). It is, for example, used in… …   Wikipedia

• Erlang unit — The erlang (symbol E [ [http://www.unc.edu/ rowlett/units/dictE.html How Many? A Dictionary of Units of Measurement] ] ) as a dimensionless unit is used in telephony as a statistical measure of the volume of telecommunications traffic. It is… …   Wikipedia

• Exponential distribution — Not to be confused with the exponential families of probability distributions. Exponential Probability density function Cumulative distribution function para …   Wikipedia

• Queueing theory — is the mathematical study of waiting lines (or s ). The theory enables mathematical analysis of several related processes, including arriving at the (back of the) queue, waiting in the queue (essentially a storage process), and being served by… …   Wikipedia

• Engset calculation — The Engset calculation is a formula to determine the probability of congestion occurring within a telephony circuit group. It was named after its developer, T. O. Engset. The level of congestion can be used to determine a network s performance as …   Wikipedia

• Tsung — (formerly known as idx Tsunami) is a stress testing tool written in the Erlang language and distributed under the GPL license. It can currently stress test HTTP, PostgreSQL , SOAP and Jabber/XMPP servers. Tsung can simulate hundreds of… …   Wikipedia

• Havoc in Heaven — Directed by Wan Laiming Produced by Wan brothers …   Wikipedia

• Queueing model — In queueing theory, a queueing model is used to approximate a real queueing situation or system, so the queueing behaviour can be analysed mathematically. Queueing models allow a number of useful steady state performance measures to be determined …   Wikipedia

• Actor model — In computer science, the Actor model is a mathematical model of concurrent computation that treats actors as the universal primitives of concurrent digital computation: in response to a message that it receives, an actor can make local decisions …   Wikipedia

• Pollaczek–Khinchine formula — In queueing theory, a discipline within the mathematical theory of probability, the Pollaczek–Khinchine formula is a formula for the mean queue length in a model where jobs arrive according to a Poisson process and service times have a general… …   Wikipedia

• Traffic intensity — In telecommunication networks, traffic intensity is a measure of the average occupancy of a server or resource during a specified period of time, normally a busy hour.It is measured in traffic units (erlangs) and defined as the ratio of the time… …   Wikipedia